Practical Multi-Party Private Set Intersection Protocols

Privacy-preserving techniques for processing sets of information have attracted the research community’s attention in recent years due to society’s increasing dependency on availability data at any time. One fundamental problems set operations is known as Private Set Intersection (PSI). The problem requires two parties compute intersection between their while preserving correctness and privacy. Although several efficient two-party PSI protocols already exist, multi-party setting (MPSI) currently scale poorly with a growing number parties, even though this applies many real-life scenarios. This paper fills gap by proposing based Bloom filters threshold homomorphic PKEs, which are secure semi-honest model. first protocol PSI, whereas second provides more subtle functionality - xmlns:xlink="http://www.w3.org/1999/xlink">threshold (T-MPSI) outputs items server that appear least some other private sets. inspired Davidson-Cid filters. We compare our MPSI against Kolesnikov xmlns:xlink="http://www.w3.org/1999/xlink">et al. , among fastest protocols. Our performs better than terms run time, given small there large parties. T-MPSI existing works: computational communication complexities linear elements largest fixed colluding conclude practical solutions suitable emerging use-case scenarios where previous did not well.